Fairing spline curves and surfaces by minimizing energy

نویسندگان

  • Caiming Zhang
  • Pifu Zhang
  • Fuhua Cheng
چکیده

New algorithms for the classical problem of fairing cubic spline curves and bicubic spline surfaces are presented. To fair a cubic spline curve or a bicubic spline surface with abnormal portions, the algorithms (automatically or interactively) identify thèbad' data points and replace them with new points produced by minimizing the strain energy of the new curve or surface. The proposed algorithms are more general than the existing algorithms in that the new algorithms can adjust more than onèbad' data point in each modi®cation step and they include the existing algorithms [Computer-Aided Design 15(5) (1983) 288±293; 28 (1996) 59±66] as special cases. Test results of the new algorithms are included.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Target Curvature Based Automatic Fairing of Planar B-Spline Curves

A new automatic local fairing technique for planar B-spline curves is presented in this paper. According to the design intent, a target curvature plot, which is provided by the designer, is used to identify ‘bad’ points and ‘bad’ curve segments. Then, the corresponding control points are modified in a process of local constrained optimization where the importance of fairness in the sense of ene...

متن کامل

Fast and Local Fairing of B-Spline Curves and Surfaces

The paper proposes a fast fairing algorithm for curves and surfaces. It rst de nes a base algorithm for fairing curves, which is then extended to the surface case, where the isocurves of the surface are faired. The curve fairing process involves the discrete integration of a pseudo-arc-length parameterization of B-spline curves, with a blending and tting phase concluding the algorithm. In the c...

متن کامل

Local Energy Fairing of B{Spline Surfaces

An algorithm for local fairing of B-spline surfaces of arbitrary order is presented. This stepwise algorithm is based on the idea of changing only one control point in each iteration step. Which point has to be changed is determined by a ranking-list where all control points are sorted in regard to their corresponding values of a suitable chosen fairness criterion. The criterion is chosen in su...

متن کامل

Local Energy Fairing of B-spline Curves

An automatic algorithm for fairing B-spline curves of general order is presented. This work was motivated by a method of Farin and Sapidis about fairing planar cubic B-spline curves by subsequently removing and reinserting knots. Instead our new algorithm is based on the idea of subsequently changing one control point of a given B-spline curve so that the new curve minimizes the integral of the...

متن کامل

Stitching B - Spline Curves Symbolically Stitching B - spline

Stitching or merging B-spline curves is a frequently used technique in geometric modeling, and is usually implemented in CAD-systems. These algorithms are basically numerical interpolations using the least squares method. The problem, how to replace two or more curves which are generated separately and defined as B-spline curves, has well functioning numerical solutions, therefore, relatively f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer-Aided Design

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2001